Improved Convergence Rates for Intermediate Problems
نویسندگان
چکیده
Improved convergence rate estimates are derived for a variant of Aronszajn-type intermediate problems that is both computationally feasible and convergent for problems with nontrivial essential spectra. In a previous paper the authors obtained rate of convergence estimates for this method in terms of containment gaps between subspaces. In the present work, techniques for estimating relatively unbounded perturbations are refined in order to apply the Kato-Temple inequalities. This yields convergence rates for the intermediate operator eigenvalues in terms of squares of containment gaps between subspaces. Convergence rate estimates are also obtained for the intermediate problem eigenvectors, and comparisons are made with previously known results for the method of special choice.
منابع مشابه
CONVERGENCE THEOREMS FOR ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS IN THE INTERMEDIATE SENSE FOR THE MODIFIED NOOR ITERATIVE SCHEME
We study the convergence of the modified Noor iterative scheme for the class of asymptotically pseudocontractive mappings in the intermediate sense which is not necessarily Lipschitzian. Our results improves, extends and unifies the results of Schu [23] and Qin {it et al.} [25].
متن کاملImproved intermediate asymptotics for the heat equation
This letter is devoted to results on intermediate asymptotics for the heat equation. We study the convergence towards a stationary solution in self-similar variables. By assuming the equality of some moments of the initial data and of the stationary solution, we get improved convergence rates using entropy / entropy-production methods. We establish the equivalence of the exponential decay of th...
متن کاملEfficient Strategy based on Improved Biogeography-based Algorithm for Inventory Routing problem
Researchers and urban administrators have often considered the routing problem as one of the fundamental phases in developing hazard management systems. In this research, a routing problem is investigated and analyzed by proposing an enhanced metaheuristic algorithm based on biogeography. In this problem, the production planning, inventory management, and distribution planning have been conside...
متن کاملEfficient Uzawa Algorithms for Two Phase Stefan Type Problems
In this paper we present and analyze Uzawa type algorithms for solving discretized variational inequalities arising from two phase Stefan type problems. For a Uzawa type algorithm and its improved version we show convergence and derive bounds on convergence rates. For the improved Uzawa algorithm, the convergence rate is shown to be uniformly bounded away from 1 if τh−2 is kept bounded, with τ ...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010